Homomorphic Encryption with Access Policies: Characterization and New Constructions
نویسندگان
چکیده
A characterization of predicate encryption (PE) with support for homomorphic operations is presented and we describe the homomorphic properties of some existing PE constructions. Even for the special case of IBE, there are few known group-homomorphic cryptosystems. Our main construction is an XOR-homomorphic IBE scheme based on the quadratic residuosity problem (variant of the Cocks’ scheme), which we show to be strongly homomorphic. We were unable to construct an anonymous variant that preserves this homomorphic property, but we achieved anonymity for a weaker notion of homomorphic encryption, which we call non-universal. A related security notion for this weaker primitive is formalized. Finally, some potential applications and open problems are considered.
منابع مشابه
Threshold Fully Homomorphic Encryption
We formally define and give the first construction of (leveled) threshold fully homomorphic encryption for any access structure induced by a monotone boolean formula and in particular for the threshold access structure. Our construction is based on the learning with errors assumption and can be instantiated with any existing homomorphic encryption scheme that satisfies fairly general conditions...
متن کاملSufficient Conditions for Collision-Resistant Hashing
We present several new constructions of collision-resistant hash-functions (CRHFs) from general assumptions. We start with a simple construction of CRHF from any homomorphic encryption. Then, we strengthen this result by presenting constructions of CRHF from two other primitives that are implied by homomorphic-encryption: one-round private information retrieval (PIR) protocols and homomorphic o...
متن کاملRiding on Asymmetry: Efficient ABE for Branching Programs
In an Attribute-Based Encryption (ABE) scheme the ciphertext encrypting a message μ, is associated with a public attribute vector x and a secret key skP is associated with a predicate P . The decryption returns μ if and only if P (x) = 1. ABE provides efficient and simple mechanism for data sharing supporting fine-grained access control. Moreover, it is used as a critical component in construct...
متن کاملAn Efficient Protocol for Restricted Adaptive Oblivious Transfer
Restricted adaptive oblivious transfer was introduced by Herranz in 2011, which is the main approach to protect user privacy in e-transactions involving operations on digital confidential data or sensitive information. There are many practical applications for restricted adaptive oblivious transfer, such as medical or financial data access, pay-per-view TV, and so on. However, so far as we know...
متن کاملTowards practical private information retrieval from homomorphic encryption
Private information retrieval (PIR) allows a client to retrieve data from a remote database while hiding the client’s access pattern. To be applicable for practical usage, PIR protocol should have low communication and computational costs. In this paper a new generic PIR protocol based on somewhat homomorphic encryption (SWHE) is proposed. Compared to existing constructions the proposed scheme ...
متن کامل